◀ Prev · Parts · Full · Next ▶

• High-multiplicity bin packing

cite-note-11. ↑ citerefeisemann1957Eisemann, Kurt (1957-04-01). "The Trim Problem". Management Science. 3 (3): 279–284. doi:10.1287/mnsc.3.3.279. ISSN 0025-1909.

cite-note-gilmore61-22. ↑ citerefgilmoregomory1961Gilmore, P. C.; Gomory, R. E. (1961). "A Linear Programming Approach to the Cutting-Stock Problem". Operations Research. 9 (6): 849–859. doi:10.1287/opre.9.6.849. JSTOR 167051. S2CID 8079477.

cite-note-1-33. ↑ citerefkarmarkarkarp1982Karmarkar, Narendra; Karp, Richard M. (1982-11-01). "An efficient approximation scheme for the one-dimensional bin-packing problem". 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982). pp. 312–320. doi:10.1109/SFCS.1982.61. S2CID 18583908.

◀ Prev · Parts · Full · Next ▶